Improving Labeling Quality using Positive Label Frequency Threshold Algorithm
نویسندگان
چکیده
Label is a prominent issue in the classification area along with several potential negative sequences. For example, the predicted accuracy may reduce, but the complexity of inferred models and the number of necessary training samples may rise. Online outsourcing systems, such as Amazon’s Mechanical Turk, allow labelers to label the same objects but still lack in their quality. Mostly noisy labels have multiple labels for same examples. Thus, an agnostic algorithm Positive LAbel frequency Threshold (PLAT) is projected to handle the issue of imbalanced noisy labeling. The main objective is to generate the training dataset and integrated labels of examples. This method is used to solve the issue of minority sample and also able to deal with imbalanced multiple noisy labeling. The PLAT is applied to the imbalanced dataset collected from Amazon Mechanical Turk and the experiment results represents that the PLAT is efficient than other methods. Index Terms –repeated labeling, majority voting, imbalanced labeling
منابع مشابه
Imbalanced Multiple Noisy Labeling for Supervised Learning
When labeling objects via Internet-based outsourcing systems, the labelers may have bias, because they lack expertise, dedication and personal preference. These reasons cause Imbalanced Multiple Noisy Labeling. To deal with the imbalance labeling issue, we propose an agnostic algorithm PLAT (Positive LAbel frequency Threshold) which does not need any information about quality of labelers and un...
متن کاملNoise-Tolerant Interactive Learning Using Pairwise Comparisons
We study the problem of interactively learning a binary classifier using noisylabeling and pairwise comparison oracles, where the comparison oracle answerswhich one in the given two instances is more likely to be positive. Learning fromsuch oracles has multiple applications where obtaining direct labels is harder butpairwise comparisons are easier, and the algorithm can leverage...
متن کاملAutomated label placement in theory and practice
v 1 An Introduction to Label Placement 1 1.1 Historic Development . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Theory. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 . . . and Practice . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.4 Quality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.5 Future Development . . . . . . . . . ....
متن کاملFloating Labels: Improving Dynamics of Interactive Labeling Approaches
The fastest existing labeling-algorithms allow the labeling of thousands of objects within a few milliseconds on today’s desktop computers. Thus, it is possible to recalculate the labeling in dynamic scenes for every frame as it is demanded in interactive scenarios like information visualization. The main problem in such dynamic labeling environments is the lack of frame-to-frame coherence. Top...
متن کاملA generalized threshold algorithm for the shortest path problem with time windows
In this paper, we present a new labeling algorithm for the shortest path problem with time windows (SPPTW). It is generalized from the threshold algorithm for the unconstrained shortest path problem. Our computational experiments show that this generalized threshold algorithm outperforms a label setting algorithm for the SPPTW on a set of randomly generated test problems. The average running ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016